Tim Roughgarden - PDFSEARCH.IO - Document Search Engine

Tim Roughgarden
Results: 191

#	Item
61	CS261: A Second Course in Algorithms Lecture #4: Applications of Maximum Flows and Minimum Cuts∗ Tim Roughgarden† January 14, 2016 Add to Reading List Source URL: theory.stanford.edu - Date: 2016-03-05 16:17:54
62	Equilibrium Efficiency and Price Complexity in Sponsored Search Auctions Moshe Babaioff∗ Tim Roughgarden† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2010-05-25 00:22:55 Auction theory Game theory Auctions Mechanism design Mathematics Decision theory VickreyClarkeGroves mechanism VickreyClarkeGroves auction Sponsored search auction Valuation Auction Vickrey auction
63	CS364A: Algorithmic Game Theory Lecture #17: No-Regret Dynamics∗ Tim Roughgarden† November 18, 2013 This lecture continues to study the questions introduced last time. Do strategic players reach an equilibrium of a g Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-12-03 15:11:32 Mathematical logic Theoretical computer science Regret Mathematics Game theory Academia Applied mathematics Algorithms Swap regret
64	CS261: A Second Course in Algorithms Lecture #2: Augmenting Path Algorithms for Maximum Flow∗ Tim Roughgarden† January 7, 2016 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-01-22 08:04:42 Graph theory Network flow Mathematics EdmondsKarp algorithm Flow network Maximum flow problem FordFulkerson algorithm Cut Graph traversal Minimum cut Shortest path problem Max-flow min-cut theorem
65	CS168: The Modern Algorithmic Toolbox Lecture #18: Linear and Convex Programming, with Applications to Sparse Recovery Tim Roughgarden & Gregory Valiant∗ May 25, 2016 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-06-04 09:49:43 Mathematical optimization Numerical analysis Mathematical analysis Operations research Linear programming Convex optimization Convex analysis Ellipsoid method Feasible region Convex function Linear inequality Candidate solution
66	CS364A: Algorithmic Game Theory Lecture #14: Robust Price-of-Anarchy Bounds in Smooth Games∗ Tim Roughgarden† November 6, 2013 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-09-22 16:38:00 Game theory Mathematics Academia Price of anarchy Nash equilibrium Solution concept Potential game Human behavior
67	CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-01-06 16:13:01 Computational complexity theory Theory of computation Complexity classes NP Clique problem Linear programming P Algorithm Time complexity Optimization problem Book:Graph Theory P versus NP problem
68	CS364A: Algorithmic Game Theory Lecture #5: Revenue-Maximizing Auctions∗ Tim Roughgarden† October 7, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-09-22 16:28:39 Mechanism design Game theory Auction theory Decision theory Gaming Auctions Vickrey auction First-price sealed-bid auction Virtual valuation Auction Incentive compatibility Revelation principle
69	CS364A: Algorithmic Game Theory Lecture #15: Best-Case and Strong Nash Equilibria∗ Tim Roughgarden† November 11, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-06-11 10:32:09 Game theory Decision theory Gaming Mathematics Price of stability Nash equilibrium Price of anarchy Potential game Solution concept Strategic dominance Algorithmic game theory Strategy
70	CS364A: Algorithmic Game Theory Lecture #4: Algorithmic Mechanism Design∗ Tim Roughgarden† October 2, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-09-22 16:26:58 Game theory Mechanism design Auction theory Decision theory Gaming Revelation principle Knapsack problem Algorithmic mechanism design Vickrey auction First-price sealed-bid auction Algorithmic game theory Auction

UPDATE